On Resolution in Fragments of Classical Linear Logic
نویسندگان
چکیده
We present a proof-theoretic foundation for logic programming in Girard's linear logic. We exploit the permutability properties of two-sided linear sequent calculus to identify appropriate notions of uniform proof, deenite formula, goal formula, clause and resolution proof for fragments of linear logic. The analysis of this paper extends earlier work by the present authors to include negative occurrences of z (par) and positive occurrences of ! (of course !) and ? (why not ?). These connectives introduce considerable diiculty. We consider brieey some of the issues related to the mechanical implementation of our resolution proofs.
منابع مشابه
Simulating Linear Logic in 1-Only Linear Logic
Linear Logic was introduced by Girard as a resource-sensitive refinement of classical logic. It turned out that full propositional Linear Logic is undecidable (Lincoln, Mitchell, Scedrov, and Shankar) and, hence, it is more expressive than (modalized) classical or intuitionistic logic. In this paper we focus on the study of the simplest fragments of Linear Logic, such as the one-literal and con...
متن کاملAffine Control Logic
This paper extends our previous work in combining classical logic with intuitionistic logic [LM13a, LM13b] to also include affine linear logic (linear logic with weakening), resulting in a unified system that we call Affine Control Logic. Connectives from different logics can mix without collapse, and fragments of the logic are defined not by restricting proofs but entirely by the subformula pr...
متن کاملThe Undecidability of Second Order Linear Logic Without Exponentials
Recently, Lincoln, Scedrov and Shankar showed that the multi-plicative fragment of second order intuitionistic linear logic is undecidable, using an encoding of second order intuitionistic logic. Their argument applies to the multiplicative-additive fragment, but it does not work in the classical case, because second order classical logic is decidable. Here we show that the multiplicative-addit...
متن کاملThe Computational Complexity of Satisfiability of Temporal Horn Formulas in Propositional Linear-Time Temporal Logic
Since the invention of Prolog, a programming language based on classical first-order logic, many people have tried to extend it using similiar ideas and redefine the semantics of the extended Prolog in terms of nonclassical logics [3,5,81. The success of a programming language based on nonclassical logics usually lies in the new definiton of Horn formulas and SLD-resolution-like inference rule....
متن کاملFree Algebras Corresponding to Multiplicative Classical Linear Logic and Some Extensions
In this paper, constructions of free algebras corresponding to mul-tiplicative classical linear logic, its aane variant and their extensions with n-contraction (n 2) are given. As an application, the cardinal-ity problem of some one-variable linear fragments with n-contraction is solved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992